SUMA: A Partial Materialization-Based Scalable Query Answering in OWL 2 DL

نویسندگان

چکیده

Abstract Ontology-mediated querying (OMQ) provides a paradigm for query answering according to which users not only records at the database but also implicit information inferred from ontology. A key challenge in OMQ is that may be infinite, cannot stored and queried by off -the -shelf engine. The commonly adopted technique deal with infinite entailments rewriting, which, however, comes cost of rewriting runtime. In this work, partial materialization method proposed ensure extension always finite. technology does rewrite instead computes consequences entailed ontology before online query. Besides, analysis algorithm designed completeness rooted Boolean conjunctive queries over materialization. We soundly incompletely expand our support highly expressive language, OWL 2 DL. Finally, we further optimize efficiency role implement approach as prototype system SUMA integrating off-the-shelf efficient SPARQL experiments show complete on each test query, same Pellet outperforms PAGOdA. scalable large datasets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query Answering for OWL-DL with Rules

Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, we present a decidable such combination where rules are required to be DL-safe: each variable in t...

متن کامل

Completeness Guaranteed Approximations for OWL-DL Query Answering

How to provide scalable and quality guaranteed approximation for query answering over expressive description logics (DLs) is an important problem in knowledge representation (KR). This is a pressing issue, in particular due to the fact that, for the widely used standard Web Ontology Language OWL, whether conjunctive query answering is decidable is still an open problem. Pan and Thomas propose a...

متن کامل

OWL Query Answering Based on Query Extension

The paper presents an approach for optimizing query answering algorithms that are based on approximate instance retrieval. We consider SPARQL instance queries over OWL ontologies and use the OWL 2 Direct Semantics entailment regime of SPARQL for their evaluation. Approximate query answering algorithms are based on the creation of two sets; the set of certain or known query answers and the set o...

متن کامل

A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL

Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we propose a decomposition-based approach to optimizing existing OWL DL reasoners in evaluating conjunctive queries in OWL DL ontologies. The main idea is to decompose a given OWL DL ontology into a set of target ontologies ...

متن کامل

Hydrowl: A Hybrid Query Answering System for OWL 2 DL Ontologies

This system description paper introduces the OWL 2 query answering system Hydrowl. Hydrowl is based on novel hybrid techniques which in order to compute the query answers combine at run-time a reasoner ans1 supporting a (tractable) fragment of OWL 2 (e.g., OWL 2 QL and OWL 2 RL) with a fully-fledged OWL 2 DL reasoner ans2. The motivation is that if most of the (query answering) work is delegate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Data Science and Engineering

سال: 2021

ISSN: ['2364-1541', '2364-1185']

DOI: https://doi.org/10.1007/s41019-020-00150-0